Pliable Rejection Sampling

نویسندگان

  • Akram Erraqabi
  • Michal Valko
  • Alexandra Carpentier
  • Odalric-Ambrym Maillard
چکیده

Rejection sampling is a technique for sampling from difficult distributions. However, its use is limited due to a high rejection rate. Common adaptive rejection sampling methods either work only for very specific distributions or without performance guarantees. In this paper, we present pliable rejection sampling (PRS), a new approach to rejection sampling, where we learn the sampling proposal using a kernel estimator. Since our method builds on rejection sampling, the samples obtained are with high probability i.i.d. and distributed according to f . Moreover, PRS comes with a guarantee on the number of accepted samples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pliable rejection sampling

Using Assumptions 1 and 2 and the fact that k · k 2  k · k s , since s  2, we have that for any x 2 [0, A]

متن کامل

Regional Flap in Head and Neck Reconstruction- Part I: Philosophy, Submental and Supraclavicular Flaps

Background: Regional (pedicled) flaps for reconstruction of intra-oral defects are acquiring increasing recognition as a safe, reliable choice in selected cases after oral cancer ablation (extirpation). The lower technical demands and suitability for elderly/high-risk patients together with specific features that may resolve the seemingly intractable dilemmas with other approaches, are providin...

متن کامل

Another Look at Rejection Sampling Through Importance Sampling

We provide a different view of rejection sampling by putting it in the framework of importance sampling. When rejection sampling with an envelope function g is viewed as a special importance sampling algorithm, we show that it is inferior to the importance sampling algorithm with g as the proposal distribution in terms of the Chi-square distance between the proposal distribution and the target ...

متن کامل

Bayesian inference via rejection filtering

We provide a method for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle filtering. We also provide an approximate form of rejection sampling that makes rejection filtering tractable in cases where exact rejection sampl...

متن کامل

Adaptive Rejection Sampling with fixed number of nodes

The adaptive rejection sampling (ARS) algorithm is a universal random generator for drawing samples efficiently from a univariate log-concave target probability density function (pdf). ARS generates independent samples from the target via rejection sampling with high acceptance rates. Indeed, ARS yields a sequence of proposal functions that converge toward the target pdf, so that the probabilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016